On a Problem concerning Permutation Polynomials

نویسنده

  • GERHARD TURNWALD
چکیده

Let S(f) denote the set of integral ideals / such that / is a permutation polynomial modulo i", where / is a polynomial over the ring of integers of an algebraic number field. We obtain a classification for the sets S which may be written in the form S(f). Introduction. A polynomial f(x) with coefficients in a commutative ring R is said to be a permutation polynomial modulo an ideal I oi R (abbreviated p.p. mod /) if the mapping induced on the residue class ring R/I is bijective. From now on we assume that R is the ring of algebraic integers in an algebraic number field K (of finite degree). Put S\{f) = {P | P is a nonzero prime ideal such that f(x) is a p.p. modP but not modP2}, Si(f) = {P | P is a nonzero prime ideal and f(x) is a p.p. modP2}. Then f(x) is a p.p. modi (^ {0}) if and only if every prime divisor of / belongs to Si(/) U S2(/) and I is not divisible by the square of an element of Si(f) (cf. Lemma 1.1). It is the purpose of this paper to describe the sets Si, S2 that may be written in the form Si(/), 82(f) for some polynomial f(x) Taking R to be the ring of rational integers yields the solution of problem II posed by Narkiewicz in [4, p. 13]. Denoting the absolute norm of an ideal / by NI (= \R/I\), we obtain the following characterization: THEOREM. Let R be the ring of integers in the algebraic number field K. If Si,S2 are disjoint sets of nonzero prime ideals of R then there exists a polynomial f(x) e R[x] such that St = Si(f) (i — 1,2) if and only if one of the following conditions holds: (1) Si,52 are finite. (2) For some squarefree positive integer n with (n, 6) = 1 we have Si is a finite set of prime ideals P such that NP ^ l(n) or 2TM_1 = 0 (P); S2 differs from {P \ (NP2 — l,n) = 1} by at most finitely many elements. (3) For some positive integers m,n with (n, 6) = (m, 2) = 1, mn > 1, mn squarefree, we have Si differs from {P | (NP — l,m) = (NP2 — 1, n) = 1} by at most finitely many prime ideals P with NP ^ l(mn) or 2"_1 = 0 (P); S2 is finite. (Note that 2""1 = 0 (P) is equivalent to n > 1 and 2 = 0(P).) The theorem is an immediate consequence of Proposition 2.2, Proposition 2.13, and Proposition 4.8. For the "only if" part we make use of Fried's proof of Schur's conjecture. In §3 Received by the editors June 26, 1986. 1980 Mathematics Subject Classification (1985 Revision). Primary 11T06; Secondary 11R09.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumerating Permutation Polynomials over Finite Fields by Degree

fσ has the property that fσ(a) = σ(a) for every a ∈ Fq and this explains its name. For an account of the basic properties of permutation polynomials we refer to the book of Lidl and Niederreiter [5]. From the definition, it follows that for every σ ∂(fσ) ≤ q − 2. A variety of problems and questions regarding Permutation polynomials have been posed by Lidl and Mullen in [3, 4]. Among these there...

متن کامل

Permutation polynomials induced from permutations of subfields, and some complete sets of mutually orthogonal latin squares

We present a general technique for obtaining permutation polynomials over a finite field from permutations of a subfield. By applying this technique to the simplest classes of permutation polynomials on the subfield, we obtain several new families of permutation polynomials. Some of these have the additional property that both f(x) and f(x) + x induce permutations of the field, which has combin...

متن کامل

New Constructions of Permutation Polynomials of the Form $x^rh\left(x^{q-1}\right)$ over $\mathbb{F}_{q^2}$

Permutation polynomials over finite fields have been studied extensively recently due to their wide applications in cryptography, coding theory, communication theory, among others. Recently, several authors have studied permutation trinomials of the form xh ( x ) over Fq2 , where q = 2 , h(x) = 1+x+x and r, s, t, k > 0 are integers. Their methods are essentially usage of a multiplicative versio...

متن کامل

Some New Permutation Polynomials over Finite Fields

In this paper, we construct a new class of complete permutation monomials and several classes of permutation polynomials. Further, by giving another characterization of opolynomials, we obtain a class of permutation polynomials of the form G(x) + γTr(H(x)), where G(X) is neither a permutation nor a linearized polynomial. This is an answer to the open problem 1 of Charpin and Kyureghyan in [P. C...

متن کامل

A Class of Binomial Permutation Polynomials

For a prime power q, let Fq be the finite field with q elements and F ∗ q denote its multiplicative group. A polynomial f ∈ Fq[x] is called a permutation polynomial (PP) if its associated polynomial mapping f : c 7→ f(c) from Fq to itself is a bijection. A permutation polynomial f(x) is referred to as a complete permutation polynomial (CPP) if f(x)+x is also a permutation over Fq [4]. Permutati...

متن کامل

A New Class of Permutation Polynomials over Finite Fields

In this paper, the problem of constructing permutation polynomials over finite fields is investigated. By using the piecewise method, a class of permutation polynomials of the form (x − x + c) k(q 2−1) d +1 + x + x over Fq2 is constructed, where 1 ≤ k < d and d is an arbitrary factor of q − 1, which generalizes some known results in the literature.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010